An O(n2) algorithm for the minimal interval completion problem
نویسندگان
چکیده
The minimal interval completion problem consists in adding edges to an arbitrary graph so that the resulting graph is an interval graph; the objective is to add an inclusion minimal set of edges, which means that no proper subset of the added edges can result in an interval graph when added to the original graph. We give an O(n) time algorithm to obtain a minimal interval completion of an
منابع مشابه
An O(n)-time algorithm for the minimal interval completion problem
The minimal interval completion problem consists in adding edges to an arbitrary graph so that the resulting graph is an interval graph; the objective is to add an inclusion minimal set of edges, which means that no proper subset of the added edges can result in an interval graph when added to the original graph. We give an O(n2)-time algorithm to obtain a minimal interval completion of an arbi...
متن کاملAn O(n^2) Time Algorithm for the Minimal Permutation Completion Problem
We provide an O(n2) time algorithm computing a minimal permutation completion of an arbitrary graph G = (V,E), i.e., a permutation graph H = (V, F ) on the same vertex set, such that E ⊆ F and F is inclusion-minimal among all possibilities.
متن کاملBounded, minimal, and short representations of unit interval and unit circular-arc graphs
We consider the unrestricted, minimal, and bounded representation problems for unit interval (UIG) and unit circular-arc (UCA) graphs. In the unrestricted version, a proper circular-arc (PCA) modelM is given and the goal is to obtain an equivalent UCA model U . We show a linear time algorithm with negative certification that can also be implemented to run in logspace. In the bounded version,M i...
متن کاملMinimal and short representations of unit interval and unit circular-arc graphs
We consider the unrestricted, minimal, and bounded representation problems for unit interval (UIG) and unit circular-arc (UCA) graphs. In the unrestricted version, a proper circular-arc (PCA) modelM is given and the goal is to obtain an equivalent UCA model U . We show a linear time algorithm with negative certification that can also be implemented to run in logspace. In the bounded version,M i...
متن کاملMathematical Analysis of Optimal Tracking Interval Management for Power Efficient Target Tracking Wireless Sensor Networks
In this paper, we study the problem of power efficient tracking interval management for distributed target tracking wireless sensor networks (WSNs). We first analyze the performance of a distributed target tracking network with one moving object, using a quantitative mathematical analysis. We show that previously proposed algorithms are efficient only for constant average velocity objects howev...
متن کامل